A Separated Cohomologically Complete Module is Complete
نویسندگان
چکیده
منابع مشابه
Local Cohomology with Respect to a Cohomologically Complete Intersection Pair of Ideals
Let $(R,fm,k)$ be a local Gorenstein ring of dimension $n$. Let $H_{I,J}^i(R)$ be the local cohomology with respect to a pair of ideals $I,J$ and $c$ be the $inf{i|H_{I,J}^i(R)neq0}$. A pair of ideals $I, J$ is called cohomologically complete intersection if $H_{I,J}^i(R)=0$ for all $ineq c$. It is shown that, when $H_{I,J}^i(R)=0$ for all $ineq c$, (i) a minimal injective resolution of $H_{I,...
متن کاملIs the Contemporary Account of Weakness of Will Complete?
Before an outstanding article in 1999 by Richard Holton, weakness of will was identified as an agent's action contrary to his or her better judgment, while other better choices are available. The contemporary account of weakness of will (i.e., Holton’s theory) explains it in terms of intention. Accordingly, weakness of will happens if an agent fails to stick to his or her previously formed inte...
متن کاملPacking Trominoes is NP-Complete, #P-Complete and ASP-Complete
We study the computational complexity of packing puzzles of identical polyominoes. Packing dominoes (i.e., 1 × 2 rectangles) into grid polygons can be solved in polynomial time by reducing to a bipartite matching problem. On the other hand, packing 2 × 2 squares is known to be NP-complete. In this paper, we fill the gap between dominoes and 2 × 2 squares, that is, we consider the packing puzzle...
متن کاملSystematic Imaging Module in Complete Hindgut Duplication
Complete hind gut and anal canal duplication is a rare entity, usually remaining asymptomatic till the disease comes to light due to associated anomalies or due to cosmetic reasons. Classical imaging consisting of barium enema examination served a limited role, in terms of depicting the length of gut segment involved. Technical advances in magnetic resonance imaging (MRI) with three-dimensional...
متن کاملFillmat is NP-Complete and ASP-Complete
We study the computational complexity of a packing puzzle Fillmat, which is a type of pencil-and-paper puzzles made by Japanese puzzle publisher Nikoli. We show that the problem to decide if a given instance of Fillmat has a solution is NP-complete by a reduction from the circuit-satisfiability problem (Circuit-SAT). Our reduction is carefully designed so that we can also prove ASP-completeness...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Algebra
سال: 2014
ISSN: 0092-7872,1532-4125
DOI: 10.1080/00927872.2014.924129